Equilibrium bandwidth and buffer allocations for elastic traffics
نویسندگان
چکیده
منابع مشابه
Equilibrium Bandwidth and Buuer Allocations for Elastic Traacs
| Consider a set of users sharing a network node under an allocation scheme that provides each user with a xed minimum and a random extra amount of bandwidth and buuer. Allocations and prices are adjusted to adapt to resource availability and user demands. Equilibrium is achieved when all users optimize their utility and demand equals supply for non-free resources. We analyze two models of user...
متن کاملEquilibrium Allocation of Variable Resources for Elastic Traffics
Consider a set of connections sharing a network node under an allocation scheme that provides each connection with a fixed minimum and a random extra amount of bandwidth and buffer. Allocations and prices are adjusted to adapt to resource availability y and user demands. We consider two scenarios of user behavior. In the first scenario a connection purchases an allocation to maximize its expect...
متن کاملComparing Sunspot Equilibrium and Lottery Equilibrium Allocations: The Finite Case
Sunspot equilibrium and lottery equilibrium are two stochastic solution concepts for nonstochastic economies. Recent work on nonconvex exchange economies has shown that when the randomizing device is a continuous random variable, applying the two concepts to the same fundamental economy yields the same set of equilibrium allocations. In the present paper, we examine economies based on a discret...
متن کاملA Differentiated Pricing Framework for Improving the Performance of the Elastic Traffics in Data Networks
Rate allocation has become a demanding task in data networks as diversity in users and traffics proliferate. Most commonly used algorithm in end hosts is TCP. This is a loss based scheme therefore it exhibits oscillatory behavior which reduces network performance. Moreover, since the price for all sessions is based on the aggregate throughput, losses that are caused by TCP affect other sessions...
متن کاملOptimal Buffer and Bandwidth Allocation using Effective Bandwidth
We consider a single node which multiplexes a large number of traffic sources. We restrict ourselves to consideration of aggregates of i.i.d. flows that can modelled using effective bandwidth results. We are concerned with the amount of buffer and bandwidth that should be allocated to this aggregate, under a maximum overflow probability constraint. Unlike previous approaches which assume that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2000
ISSN: 1063-6692
DOI: 10.1109/90.851983